PCP theorem
THEOREM IN COMPLEXITY THEORY THAT EVERY PROBLEM IN NP HAS PROBABILISTICALLY CHECKABLE PROOFS
PCP Theorem; PCP characterization theorem; PCP Characterization Theorem; QPCP theorem; Quantum PCP theorem; Probabilistically checkable proof theorem; Quantum PCP conjecture
In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and logarithmic randomness complexity (uses a logarithmic number of random bits).